package A1动态规划;

public class LC_1143最长公共子序列 {
    public static void main(String[] args){
        String text1 = "abcde";
        String text2 = "ace";
        System.out.println(longestCommonSubsequence(text1,text2));
    }
    public static int longestCommonSubsequence(String text1, String text2) {
        int[][] dp=new int[text1.length()+1][text2.length()+1];
        for(int i=0;i<text1.length();i++)
            dp[i][0]=0;
        for(int j=0;j<text2.length();j++)
            dp[0][j]=0;
        char[] c1=text1.toCharArray();
        char[] c2=text2.toCharArray();
        for(int i=1;i<=c1.length;i++)
            for(int j=1;j<=c2.length;j++){
                if(c1[i-1]==c2[j-1])
                    dp[i][j]=dp[i-1][j-1]+1;
                else
                    dp[i][j]=Math.max(dp[i][j-1],dp[i-1][j]);
            }
        return dp[text1.length()][text2.length()];
    }
}
